Parallel String Matching Algorithm Using Grid

Grid computing provides solutions for various complex problems. Implementing computing intensive applications such as string matching problem on grid is inevitable. In this paper we present a new method for exact string matching based on grid computing. The function of the grid is to parallelize the string matching problem using grid MPI parallel programming method or loosely coupled parallel services on Grid. There can be dedicated grid, other way it can be resource sharing among the existing network of computing resources, we propose dedicated grid. Parallel applications fall under three categories namely Perfect parallelism, Data parallelism and Functional parallelism, we use data parallelism, and it is also called Single Program Multiple Data (SPMD) method, where given data is divided into several parts and working on the part simultaneously. This improves the executing time of the string matching algorithms on grid. The simulation results show significant improvement in executing time and speed up.